The $k$-means algorithm is a very prevalent clustering method because of its simplicity, effectiveness, and speed, but its main disadvantage is its high sensitivity to the initial positions of the cluster centers. The global $k$-means is a deterministic algorithm proposed to tackle the random initialization problem of k-means but requires high computational cost. It partitions the data to $K$ clusters by solving all $k$-means sub-problems incrementally for $k=1,\ldots, K$. For each $k$ cluster problem, the method executes the $k$-means algorithm $N$ times, where $N$ is the number of data points. In this paper, we propose the global $k$-means$++$ clustering algorithm, which is an effective way of acquiring quality clustering solutions akin to those of global $k$-means with a reduced computational load. This is achieved by exploiting the center section probability that is used in the effective $k$-means$++$ algorithm. The proposed method has been tested and compared in various well-known real and synthetic datasets yielding very satisfactory results in terms of clustering quality and execution speed.

动态复制是一种广泛的多拷贝路由方法，用于有效地应对移动机会主义网络中的间歇性连接。根据它，节点基于禁用后者的适合将消息传送到目的地的实用程序值，将消息副本转发到遇到的节点。该方法的普及源于其灵活性，在不需要特殊定制的情况下有效地在网络中有效地运行。尽管如此，其缺点是产生大量副本的趋势，这些副本消耗有限的资源，如能量和存储。为了解决问题，我们使观察到网络节点可以根据其实用程序值分组到描绘不同递送能力的集群中。我们利用此查找来转换基本转发策略，该策略是使用越来越多的效用的节点移动数据包，并实际上通过增加传递能力的集群来转发。新策略在Synernery中使用基本动态复制算法，可完全可配置，因此它可以与几乎任何实用程序功能一起使用。我们还扩展了我们的方法，同时使用两个实用程序功能，该功能在展示社会特征的移动网络中特别有效。通过在广泛的现实生活网络中进行实验，我们经验证明我们的方法在通过不同的连接特性下减少网络中的副本数量的整体数量，而没有同时阻碍输送效率。